Dirac’s theorem on chordal graphs and Alexander duality
نویسندگان
چکیده
منابع مشابه
Dirac's theorem on chordal graphs and Alexander duality
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac’s theorem on chordal graphs.
متن کاملDistributive Lattices, Bipartite Graphs and Alexander Duality
A certain squarefree monomial ideal HP arising from a finite partially ordered set P will be studied from viewpoints of both commutative algbera and combinatorics. First, it is proved that the defining ideal of the Rees algebra of HP possesses a quadratic Gröbner basis. Thus in particular all powers of HP have linear resolutions. Second, the minimal free graded resolution of HP will be construc...
متن کاملTetrahedral Curves via Graphs and Alexander Duality
A tetrahedral curve is a (usually nonreduced) curve in P defined by an unmixed, height two ideal generated by monomials. We characterize when these curves are arithmetically Cohen-Macaulay by associating a graph to each curve and, using results from combinatorial commutative algebra and Alexander duality, relating the structure of the complementary graph to the Cohen-Macaulay property.
متن کاملA Decomposition Theorem for Chordal Graphs and its Applications
We introduce a special decomposition, the so-called split-minors, of the reduced clique graphs of chordal graphs. Using this notion, we characterize asteroidal sets in chordal graphs and clique trees with minimum number of leaves.
متن کاملCoarse Alexander Duality and Duality Groups
We study discrete group actions on coarse Poincare duality spaces, e.g. acyclic simplicial complexes which admit free cocompact group actions by Poincare duality groups. When G is an (n − 1) dimensional duality group and X is a coarse Poincare duality space of formal dimension n, then a free simplicial action G y X determines a collection of “peripheral” subgroups H1, . . . , Hk ⊂ G so that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2004
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2003.12.008